Towards Limited Scale-free Topology with Dynamic Peer Participation

نویسندگان

  • Xiaoyan Lu
  • Eyuphan Bulut
  • Boleslaw K. Szymanski
چکیده

Growth models have been proposed for constructing the scale-free overlay topology to improve the performance of unstructured peer-to-peer (P2P) networks. However, previous growth models are able to maintain the limited scale-free topology when nodes only join but do not leave the network; the case of nodes leaving the network while preserving a precise scaling parameter is not included in the solution. Thus, the full dynamic of node participation, inherent in P2P networks, is not considered in these models. In order to handle both nodes joining and leaving the network, we propose a robust growth model E-SRA, which is capable of producing the perfect limited scale-free overlay topology with user-defined scaling parameter and hard cut-off. Scalability of our approach is ensured since no global information is required to add or remove a node. E-SRA is also tolerant to individual node failure caused by errors or attacks. Simulations have shown that E-SRA outperforms other growth models by producing topologies with high adherence to the desired scale-free property. Search algorithms, including flooding and normalized flooding, achieve higher efficiency over the topologies produced by E-SRA.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Building Efficient Limited Scale-Free Overlay Topologies for Unstructured P2P Networks

In addition to the peer/data organization and search algorithm, the overlay network topology (logical connectivity graph) among peers is a crucial component in unstructured peer-to-peer (P2P) networks. Its topological characteristics significantly affect the efficiency of a search on such unstructured P2P networks. Scale-free (power-law) overlay network topologies are one type of the structures...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

Efficient Limited Scale-free Overlay Topologies for Peer-to-peer Network Architecture

Different networking applications are provided in Overlay network topologies for abstraction over underlying network architecture. Characteristics of underlying network architecture plays an important role of apps functioning. Scalefree (power-law) overlay network topologies whose structure that will show a greater functioning to the networks. Generally in small portion of nodes the major key p...

متن کامل

Scale-Free Networks to Search in Unstructured Peer-To-Peer Networks

Unstructured peer-to-peer file sharing networks are very popular in the market. They introduce network traffic. The resultant networks are not perform search efficiently because existing overlay topology formation algorithms are creates unstructured P2P networks without performance guarantees. In this paper, We compares structured and unstructured overlays, Showing through analytical and simula...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Networks

دوره 106  شماره 

صفحات  -

تاریخ انتشار 2016